Verifying heterogeneous multi-agent programs
نویسندگان
چکیده
We present a new approach to verifying heterogeneous multi-agent programs — multi-agent systems in which the agents are implemented in different (BDI-based) agent programming languages. Our approach is based on meta-APL, a BDI-based agent programming language that allows both an agent’s plans and its deliberation strategy to be encoded as part of the agent program. The agent programs comprising a heterogeneous multi-agent program are first translated into meta-APL, and the resulting system is then verified using the Maude term rewriting system. We prove correctness of translations of Jason and 3APL programs and deliberation strategies into meta-APL. Preliminary experimental results indicate that our approach can significantly out-perform previous approaches to verification of heterogeneous multi-agent programs.
منابع مشابه
The complexity of symbolic model checking temporal-epistemic logics
This paper presents complexity results for symbolic model checking for CTLK, a logic to reason about time and knowledge in multi-agent systems. We apply these results to investigate the complexity of verifying concurrent programs.
متن کاملAdaptive Distributed Consensus Control for a Class of Heterogeneous and Uncertain Nonlinear Multi-Agent Systems
This paper has been devoted to the design of a distributed consensus control for a class of uncertain nonlinear multi-agent systems in the strict-feedback form. The communication between the agents has been described by a directed graph. Radial-basis function neural networks have been used for the approximation of the uncertain and heterogeneous dynamics of the followers as well as the effect o...
متن کاملVaToMAS - Verification and Testing of Multi-Agent Systems (Dagstuhl Seminar 13181)
This report documents the program and the outcomes of Dagstuhl Seminar 13181 “VaToMAS – Verification and Testing of Multi-Agent Systems”. Seminar 28. April–03. May, 2013 – www.dagstuhl.de/13181 1998 ACM Subject Classification I.2.11 Distributed Artificial Intelligence, F.3.1 Specifying and Verifying and Reasoning about Programs, I.2.4 Knowledge Representation Formalisms and Methods
متن کاملSpecifying and verifying interaction protocols in a temporal action logic
In this paper we develop a logical framework for specifying and verifying systems of communicating agents and interaction protocols. The framework is based on Dynamic Linear Time Temporal Logic (DLTL), which extends LTL by strengthening the until operator by indexing it with the regular programs of dynamic logic. The framework provides a simple formalization of the communicative actions in term...
متن کاملVerification of Resource Requirements of Distributed Reasoning Agents
We present a framework for verifying systems composed of heterogeneous reasoning agents, in which each agent may have differing knowledge and inferential capabilities, and where the resources each agent is prepared to commit to a goal (time, memory and communication bandwidth) are bounded. The framework allows us to investigate, for example, whether a goal can be achieved if a particular agent,...
متن کامل